SCH_ACR and SCH_LD based Job Scheduling Algorithm in Grid Environment

To achieve the promising potentials by using tremendous distributed resources, effective and efficient scheduling algorithms are fundamentally important. Scheduling such applications is challenging because target resources are heterogeneous, their load and availability varies dynamically. Previous parallel system was assumed to be organized with homogeneous platform and connected via memory, bus, or LAN. But today its platform is heterogeneous and connected via Internet so each platform has different ability of computation performance and different network bandwidth. So, traditional list scheduling algorithms are inefficient to current parallel system. This research paper proposes and discusses in detail, the two new algorithms for Job scheduling on computational Grids so that the jobs are executed in minimum time and also all nodes of Grid execute equal load relative to their executing power. The main objective of this research paper is to allocate all the incoming jobs to the available computing power.